Optimality of Index Policies for Stochastic Scheduling with Switching Penalties Author(s):
نویسندگان
چکیده
We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines an optimal policy. For switching penalties that depend on the particular nodes involved in a switch, we show that although an index rule is not optimal in general, there is an exhaustive service policy that is optimal. OPTIMAL CONTROL OF QUEUES; SWITCHING COST; SWITCHING TIME; MULTI-ARMED BANDITS; COUPLING AMS 1991 SUBJECT CLASSIFICATION: PRIMARY 93E20 SECONDARY 90B35
منابع مشابه
Optimality of Index Policies for Stochastic Scheduling with Switching Penalties
We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that deenes an...
متن کاملOptimal Stochastic Scheduling of Forest Networks with Switching Penalties Author(s):
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch set-up delays which are incurred at each instant the server processes a job in a queue different from the previous one. We use ...
متن کاملMarginal productivity index policies for scheduling restless bandits with switching penalties
We address the dynamic scheduling problem for discrete-state restless bandits, where sequence-independent setup penalties (costs or delays) are incurred when starting work on a project. We reformulate such problems as restless bandit problems without setup penalties, and then deploy the theory of marginal productivity indices (MPIs) and partial conservation laws (PCLs) we have introduced and de...
متن کاملandits wi Switching alties
The multi-armed bandit problem with switching penalties (switching cost and switching delays) is investigated. It is shown that under an optimal policy, decisions about the processor allocation need to be made only at stopping times that achieve an appropriate index, the well-known “Gittins index” or a “switching index” that is defined for switching cost and switching delays. An algorithm for t...
متن کاملOptimal Stochastic Scheduling of Forest Networks with Switching Penalties 1
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch setup delays which are incurred at each instant the server processes a job in a queue diierent than the previous one. We use re...
متن کامل